RT-DBP: A Multi-Criteria Priority Assignment Scheme For Real-Time Tasks Scheduling

نویسنده

  • L. Baccouche
چکیده

Several real-time applications, such as E-commerce, multimedia and process control are subject to multiple criteria scheduling problems. In such systems service differentiation and quality of service (QoS) guarantees are necessary. Often the multi-class task model can be associated to multiple (m,k)-firm constraints indicating the degree of missed deadlines that the system can tolerate for each class. In this paper we study (m,k)-firm task scheduling and we propose a priority assignment scheme that takes into consideration various scheduling constraints. The approach is validated through simulation under various configuration patterns.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix-DBP For (m, k)-firm Real-Time Guarantee

1 (m, k)-firm means at least m deadlines should be met among any k consecutive task invocations or message transmissions. Providing (m, k)-firm guarantee is becoming attractive as it proposes an alternative between hard real-time guarantee (case of m = k) and soft (or probabilistic) real-time guarantee with p = m/k (when m, k → ∞) and allows more effective utilization of server resources (proce...

متن کامل

Multiprocessor Scheduling For Real Time Systems Embedded Systems

energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...

متن کامل

Preference-oriented fixed-priority scheduling for periodic real-time tasks

Traditionally, real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle tasks that have different execution preferences . In this paper, for a set of periodic real-time tasks running on a single processor, where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP) , we investigate Prefer...

متن کامل

Schedulability and Priority Assignment for Multi-Segment Self-Suspending Real-Time Tasks under Fixed-Priority Scheduling

Self-suspension is becoming an increasingly prominent characteristic in real-time systems such as: (i) I/O-intensive systems (ii) multi-core processors, and (iii) computation offloading systems with coprocessors, like Graphics Processing Units (GPUs). In this paper, we study the schedulability of multisegment self-suspension tasks under fixed-priority scheduling, where the executions of a multi...

متن کامل

A New Fixed-Priority Assignment Algorithm for Global Multiprocessor Scheduling RISAT

Global fixed-priority scheduling of constraineddeadline sporadic tasks systems is important not only for CPU scheduling but also in other domains, for example, scheduling real-time flows in WirelessHART networks designed for industrial process control and monitoring. In this paper, we propose a novel priority assignment scheme for scheduling such task systems on multiprocessors and demonstrate,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012